A CrambRao Lower Bound for Complex Parameters
نویسنده
چکیده
An expression is derived for a Cramer-Rao lower bound on the variance of unbiased estimators of complex parameters.
منابع مشابه
The Structure of Bhattacharyya Matrix in Natural Exponential Family and Its Role in Approximating the Variance of a Statistics
In most situations the best estimator of a function of the parameter exists, but sometimes it has a complex form and we cannot compute its variance explicitly. Therefore, a lower bound for the variance of an estimator is one of the fundamentals in the estimation theory, because it gives us an idea about the accuracy of an estimator. It is well-known in statistical inference that the Cram&eac...
متن کاملBearing Capacity of Strip Footings near Slopes Using Lower Bound Limit Analysis
Stability of foundations near slopes is one of the important and complicated problems in geotechnical engineering, which has been investigated by various methods such as limit equilibrium, limit analysis, slip-line, finite element and discrete element. The complexity of this problem is resulted from the combination of two probable failures: foundation failure and overall slope failure. The curr...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملGeneralized Local Homology Modules of Complexes
The theory of local homology modules was initiated by Matlis in 1974. It is a dual version of the theory of local cohomology modules. Mohammadi and Divaani-Aazar (2012) studied the connection between local homology and Gorenstein flat modules by using Gorenstein flat resolutions. In this paper, we introduce generalized local homology modules for complexes and we give several ways for computing ...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004